More Efficient Parallel Integer Sorting
نویسندگان
چکیده
We present a more efficient CREW PRAM algorithm for integer sorting. This algorithm sorts n integers in {0, 1, 2, ..., n} in O((log n)/ log log n) time and O(n(log n/ log log n)) operations. It also sorts n integers in {0, 1, 2, ..., n− 1} in O((log n)/ log log n) time and O(n(log n/ log log n) log log log n) operations. Previous best algorithm [13] on both cases has time complexity O(log n) but operation complexity O(n(log n)).
منابع مشابه
Pareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times
This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...
متن کاملFast Parallel Space Allocation, Estimation and Integer Sorting
Fast Parallel Space Allocation, Estimation and Integer Sorting (revised) •
متن کاملSorting and Selection on Distributed Memory Bus Computers
In this paper we study the problems of sorting and selection on the Distributed Memory Bus Computer (DMBC) recently introduced by Sahni. In particular we present: 1) An efficient algorithm for computing the sum of n bits; 2) An optimal O(1) time sorting algorithm; 3) An optimal randomized logarithmic time integer sorting algorithm; and 4) An optimal randomized constant time selection algorithm....
متن کاملA Note on Coarse Grained Parallel Integer Sorting
We observe that for n/p ≥ p, which is usually the case in practice, there exists a very simple, deterministic, optimal coarse grained parallel integer sorting algorithm with 24 communication rounds (6 n p -relations and 18 p-relations), O(n/p) memory per processor and O(n/p) local computation.
متن کامل